# computation time

computation time
время вычислений

English-Russian dictionary of computer science and programming. 2013.

### Смотреть что такое "computation time" в других словарях:

• Computation time — In computational complexity theory, computation time is a measure of how many steps are used by some abstract machine in a particular computation. For any given model of abstract machine, the computation time used by that abstract machine is a… …   Wikipedia

• Computation tree — A computation tree is a representation for the computation steps of a non deterministic Turing machine on a specified input. A computation tree is a rooted tree of nodes and edges. Each node in the tree represents a single computational state,… …   Wikipedia

• Computation of CRC — Computation of a cyclic redundancy check is derived from the mathematics of polynomial division, modulo two. In practice, it resembles long division of the binary message string, with a fixed number of zeroes appended, by the generator polynomial …   Wikipedia

• Computation tree logic — Computation tree logic (CTL) is a branching time logic, meaning that its model of time is a tree like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is… …   Wikipedia

• Computation — Com pu*ta tion, n. [L. computatio: cf. F. computation.] 1. The act or process of computing; calculation; reckoning. [1913 Webster] By just computation of the time. Shak. [1913 Webster] By a computation backward from ourselves. Bacon. [1913… …   The Collaborative International Dictionary of English

• Computation of actuarial reserves — generally refers to the process of calculating the amount which an insurance company must hold in reserve for expected future liabilities, or Actuarial reserves.The calculation process often involves a number of assumptions, particularly in… …   Wikipedia

• Time-bin encoding — is a technique used in Quantum information science to encode a qubit of information on a photon. Quantum information science makes use of qubits as a basic resource similar to bits in classical computing. Qubits are any two level quantum… …   Wikipedia

• Time-average velocity — is the averaged velocity over one period in time. It is computed by dividing by the time period the integral of the velocity from zero to the period. The computation can be represented by the following equation. = frac{1}{T} int {0}^{T} v(t),… …   Wikipedia

• Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

• Time hierarchy theorem — In computational complexity theory, the time hierarchy theorems are important statements about time bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example …   Wikipedia

• Time-evolving block decimation — The time evolving block decimation (TEBD) algorithm is a numerical scheme used to simulate one dimensional quantum many body systems, characterized by at most nearest neighbour interactions.It is dubbed Time evolving Block Decimation because it… …   Wikipedia

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»